AN EXTRAPOLATORY QUADRATURE RULEFOR ANALYTIC FUNCTIONS
نویسندگان
چکیده
منابع مشابه
Generalized quadrature formulae for analytic functions
A kind of generalized quadrature formulae of maximal degree of precision for numerical integration of analytic functions is considered. Precisely, a general weighted quadrature of Birkhoff-Young type with 4n+3 nodes and degree of precision 6n+5 is studied. Its nodes are characterized by an orthogonality relation and a general numerical method for their computation is given. Special cases and nu...
متن کاملA generalized Birkhoff-Young-Chebyshev quadrature formula for analytic functions
A generalized N-point Birkhoff–Young quadrature of interpolatory type, with the Chebyshev weight, for numerical integration of analytic functions is considered. The nodes of such a quadrature are characterized by an orthogonality relation. Some special cases of this quadrature formula are derived. 2011 Elsevier Inc. All rights reserved.
متن کاملError Estimates for Gauss Quadrature Formulas for Analytic Functions
1. Introduction. The estimation of quadrature errors for analytic functions has been considered by Davis and Rabinowitz [1]. An estimate for the error of the Gaussian quadrature formula for analytic functions was obtained by Davis [2]. McNamee [3] has also discussed the estimation of error of the Gauss-Legendre quadrature for analytic functions. Convergence of the Gaussian quadratures was discu...
متن کاملNew Error Coefficients for Estimating Quadrature Errors for Analytic Functions
Since properly normalized Chebyshev polynomials of the first kind T„(z) satisfy (?„, ?„) = [ f,(z)7ÜÖ |1 z2\~TM\dz\ = Smn for ellipses ep with foci at ± 1, any function analytic in ep has an expansion,/(z) = J3 anfn{z) with a„ = (/, Tn). Applying the integration error operator E yields E(J) = 2~Z a„E(Tn)Applying the Cauchy-Schwarz inequality to E(J) leads to the inequality |£CDIsá Z W¿2\E(Tn)\2...
متن کاملOn Estimation of Quadrature Errors for Analytic Functions 193
In the Hestenes-Stiefel method, the corresponding count is 2ra2 + 5ra + 4. In the latter method, if p„ in the last step were to be computed from the recursion relation, the method would win back the n2 multiplications which it lost to the Craig method in the first step ; but it would hardly be reasonable to calculate the last residual in this way. We note that since the algorithm in either case...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Research -GRANTHAALAYAH
سال: 2016
ISSN: 2350-0530,2394-3629
DOI: 10.29121/granthaalayah.v4.i6.2016.2631